Intersection of three-dimensional geometric surfaces

Calculating the line of intersection between two three-dimensional objects and using the information to generate a third object is a key element in a geometry development system. Techniques are presented for the generation of three-dimensional objects, the calculation of a line of intersection between two objects, and the construction of a resultant third object. The objects are closed surfaces consisting of adjacent bicubic parametric patches using Bezier basis functions. The intersection determination involves subdividing the patches that make up the objects until they are approximately planar and then calculating the intersection between planes. The resulting straight-line segments are connected to form the curve of intersection. The polygons in the neighborhood of the intersection are reconstructed and put back into the Bezier representation. A third object can be generated using various combinations of the original two. Several examples are presented. Special cases and problems were encountered, and the method for handling them is discussed. The special cases and problems included intersection of patch edges, gaps between adjacent patches because of unequal subdivision, holes, or islands within patches, and computer round-off error

Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs

The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility relations amongst the rectangles in the collection. The contribution of this paper is to propose time- and cost-optimal algorithms to construct two such graphs, namely, the dominance graph (DG, for short) and the visibility graph (VG, for short). Specifically, we show that with a collection of n non-overlapping rectangles as input, both these structures can be constructed in θ (log n) time using n processors in the CREW model

Time-Optimal Tree Computations on Sparse Meshes

The main goal of this work is to fathom the suitability of the mesh with multiple broadcasting architecture (MMB) for some tree-related computations. We view our contribution at two levels: on the one hand, we exhibit time lower bounds for a number of tree-related problems on the MMB. On the other hand, we show that these lower bounds are tight by exhibiting time-optimal tree algorithms on the MMB. Specifically, we show that the task of encoding and/or decoding n-node binary and ordered trees cannot be solved faster than Ω(log n) time even if the MMB has an infinite number of processors. We then go on to show that this lower bound is tight. We also show that the task of reconstructing n-node binary trees and ordered trees from their traversais can be performed in O(1) time on the same architecture. Our algorithms rely on novel time-optimal algorithms on sequences of parentheses that we also develop

Computational Modeling to Limit the Impact Displays and Indicator Lights Have on Habitable Volume Operational Lighting Constraints

Even with no ambient lighting system "on", the International Space Station glows at night. The glow is caused by indicator lamps and displays that are not included with the specification of the ambient lighting system. How does this impact efforts to improve the astronaut's lighting environment to promote more effective sleep patterns? Do the extra indicators and displays add enough light to change the spectrum of light the crew sees during the day as well? If spacecraft environments are specifically engineered to have an ambient lighting system that emits a spectrum promoting a healthy circadian response, is there a way control the impact? The goal of this project is to investigate how additional light sources, such as displays and indicators change the effective light spectrum of the architectural lighting system and how impacts can be mitigated

Socially-mediated arousal and contagion within domestic chick broods

Emotional contagion – an underpinning valenced feature of empathy – is made up of simpler, potentially dissociable social processes which can include socially-mediated arousal and behavioural/physiological contagion. Previous studies of emotional contagion have often conflated these processes rather than examining their independent contribution to empathic response. We measured socially-mediated arousal and contagion in 9-week old domestic chicks (n = 19 broods), who were unrelated but raised together from hatching. Pairs of observer chicks were exposed to two conditions in a counterbalanced order: air puff to conspecifics (AP) (during which an air puff was applied to three conspecifics at 30 s intervals) and control with noise of air puff (C) (during which the air puff was directed away from the apparatus at 30 s intervals). Behaviour and surface eye temperature of subjects and observers were measured throughout a 10-min pre-treatment and 10-min treatment period. Subjects and observers responded to AP with increased freezing, and reduced preening and ground pecking. Subjects and observers also showed reduced surface eye temperature - indicative of stress-induced hyperthermia. Subject-Observer behaviour was highly correlated within broods during both C and AP conditions, but with higher overall synchrony during AP. We demonstrate the co-occurrence of socially-mediated behavioural and physiological arousal and contagion; component features of emotional contagion

Complexity of Discrete Energy Minimization Problems

Discrete energy minimization is widely-used in computer vision and machine learning for problems such as MAP inference in graphical models. The problem, in general, is notoriously intractable, and finding the global optimal solution is known to be NP-hard. However, is it possible to approximate this problem with a reasonable ratio bound on the solution quality in polynomial time? We show in this paper that the answer is no. Specifically, we show that general energy minimization, even in the 2-label pairwise case, and planar energy minimization with three or more labels are exp-APX-complete. This finding rules out the existence of any approximation algorithm with a sub-exponential approximation ratio in the input size for these two problems, including constant factor approximations. Moreover, we collect and review the computational complexity of several subclass problems and arrange them on a complexity scale consisting of three major complexity classes -- PO, APX, and exp-APX, corresponding to problems that are solvable, approximable, and inapproximable in polynomial time. Problems in the first two complexity classes can serve as alternative tractable formulations to the inapproximable ones. This paper can help vision researchers to select an appropriate model for an application or guide them in designing new algorithms.Comment: ECCV'16 accepte

Track A Basic Science

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/138319/1/jia218438.pd

Enabling real-time multi-messenger astrophysics discoveries with deep learning

Multi-messenger astrophysics is a fast-growing, interdisciplinary field that combines data, which vary in volume and speed of data processing, from many different instruments that probe the Universe using different cosmic messengers: electromagnetic waves, cosmic rays, gravitational waves and neutrinos. In this Expert Recommendation, we review the key challenges of real-time observations of gravitational wave sources and their electromagnetic and astroparticle counterparts, and make a number of recommendations to maximize their potential for scientific discovery. These recommendations refer to the design of scalable and computationally efficient machine learning algorithms; the cyber-infrastructure to numerically simulate astrophysical sources, and to process and interpret multi-messenger astrophysics data; the management of gravitational wave detections to trigger real-time alerts for electromagnetic and astroparticle follow-ups; a vision to harness future developments of machine learning and cyber-infrastructure resources to cope with the big-data requirements; and the need to build a community of experts to realize the goals of multi-messenger astrophysics

The state of California current, 2001 – 2002 : will the Californa current system keep its cool, or is El Niño coming?

This report summarizes physical and biological conditions in the California Current System (CCS), from Oregon to Baja California, in 2001 and 2002. The principal sources of the observations described here are the CalCOFI (California Cooperative Oceanic Fisheries Investigations), IMECOCAL (Investigaciones Mexicanas de la Corriente de California), and U.S. GLOBECLTOP (Global Ecosystems Long-term Observation Program) programs. Large-scale atmospheric and oceanic conditions in the Pacific point to a fourth consecutive La Niña-like year. This has contributed to generally stronger than normal upwelling and uncharacteristically cool waters in much of the CCS, a pattern that has persisted since late 1998. Biological productivity has been generally higher as well, particularly off Oregon. Within the observed interannual fluctuations of recent years, these conditions suggest a generally elevated production off California and Oregon, but cool conditions have led to lower than normal zooplankton biomass off Baja California. Although the tropical Pacific has exhibited some indications of a developing El Niño, it is not likely to impact the CCS during the productive upwelling season of 2002. These observations are continuing evidence that a regime shift may have occurred in 1998, resulting in substantial change in ecosystem structure in the CCS. Continued monitoring and analysis of the state of the CCS in this context is needed. We outline a plan for an integrated monitoring program for the entire region, through the creation of ACCEO (Alliance for California Current Ecosystem Observation)